An algebraic approach to continuous collision detection for ellipsoids
نویسندگان
چکیده
Article history: Received 28 June 2010 Received in revised form 27 December 2010 Accepted 24 January 2011 Available online 28 January 2011
منابع مشابه
Real-Time Continuous Collision Detection for Moving Ellipsoids under Affine Deformation
We present an exact algebraic algorithm for real-time continuous collision detection (CCD) for moving ellipsoids under affine deformations. An efficient collision test is first developed for two static ellipsoids, which takes less than 1 microsecond. Using this practical result and the properties of our algebraic condition, we produce a real-time solution to the CCD problem that computes the ex...
متن کاملExact Collision Detection of Two Moving Ellipsoids under Rational Motions
In this paper, we describe an exact method for detecting collision between two moving ellipsoids under pre-specified rational motions. Our method is based on an algebraic condition that determines the separation status of two static ellipsoids – the condition itself is described by the signs of roots of the characteristic equation of the two ellipsoids. To deal with moving ellipsoids, we derive...
متن کاملParallel collision detection of ellipsoids with applications in large scale multibody dynamics
This contribution describes a parallel approach for determining the collision state of a large collection of ellipsoids. Collision detection is required in granular dynamics simulation where it can combine with a differential variational inequality solver or discrete element method to approximate the time evolution of a collection of rigid bodies interacting through frictional contact. The appr...
متن کاملA Novel Collision Detection Method Based on Enclosed Ellipsoid
The paper introduced an efficient collision detection method for convex polyhedra in a three -dimensional workspace. In cooperation with the enclosing and the enclosed ellipsoids of convex polyhedra, potential collisions can be detected more accurate than those methods using only bounding ellipsoids for object representation, and more efficient than the polyhedral methods. An approach for compu...
متن کاملFast Distance Computation Using Quadratically Supported Surfaces
We use the class of surfaces with quadratic polynomial support functions in order to define bounding geometric primitives for shortest distance computation. The common normals of two such surfaces can be computed by solving a single polynomial equation of degree six. Based on this observation, we formulate an algorithm for computing the shortest distance between enclosures of two moving or stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Aided Geometric Design
دوره 28 شماره
صفحات -
تاریخ انتشار 2011